Initial investigations into relating Logical and Computational Calculi
نویسنده
چکیده
2 Natural Deduction and Sequent Calculus 1 2.1 Natural Deduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 2.2 Sequent Calculus . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 2.3 Proofs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 2.3.1 Proving S using Natural Deduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 2.3.2 Proving S using Sequent Calculus . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 2.3.3 Simply Typed Lambda Calculus . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2.3.4 Type Inference of S . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
منابع مشابه
Natural Language Meets Spatial Calculi
We address the problem of relating natural language descriptions of spatial situations with spatial logical calculi, focusing on projective terms (orientations). We provide a formalism based on the theory of E-connections that connects natural language and spatial calculi. Semantics of linguistic expressions are specified in a linguistically motivated ontology, the Generalized Upper Model. Spat...
متن کاملOn the Computational Representation of Classical Logical Connectives
Many programming calculi have been designed to have a Curry-Howard correspondence with a classical logic. We investigate the effect that different choices of logical connective have on such calculi, and the resulting computational content. We identify two connectives ‘if-and-only-if’ and ‘exclusive or’ whose computational content is not well known, and whose cut elimination rules are non-trivia...
متن کاملO / 0 61 21 06 v 1 21 D ec 2 00 6 On completeness of logical relations for monadic types ⋆
Software security can be ensured by specifying and verifying security properties of software using formal methods with strong theoretical bases. In particular, programs can be modeled in the framework of lambda-calculi, and interesting properties can be expressed formally by contextual equivalence (a.k.a. observational equivalence). Furthermore, imperative features, which exist in most real-lif...
متن کاملA family of syntactic logical relations for the semantics of Haskell-like languages
Logical relations are a fundamental and powerful tool for reasoning about programs in languages with parametric polymorphism. Logical relations suitable for reasoning about observational behavior in polymorphic calculi supporting various programming language features have been introduced in recent years. Unfortunately, the calculi studied are typically idealized, and the results obtained for th...
متن کاملInvestigations on a Pedagogical Calculus of Constructions
In the last few years appeared pedagogical propositional natural deduction systems. In these systems, one must satisfy the pedagogical constraint : the user must give an example of any introduced notion. In formal terms, for instance in the propositional case, the main modification is that we replace the usual rule (hyp) by the rule (p-hyp) F ∈ Γ (hyp) Γ ⊢ F F ∈ Γ ⊢ σ · Γ (p-hyp) Γ ⊢ F where σ ...
متن کامل